Application of Clonal Selection Algorithm and Its Variant for Solving Single Objective OPF Problems

نویسنده

  • Srinivasa Rao
چکیده

Many heuristic optimization techniques derived from evolutionary algorithms are stochastic search methods that mimic the natural biological evolution and/or social behavior of spices. Such algorithms have been developed to obtain near optimal solutions to large scale optimization problems, where in traditional methods may fail. With the development of computational intelligence in recent years, the area of artificial immune systems (AIS) greatly influencing the engineering applications. This paper presents the development and comparative application of recently developed artificial immune system (AIS) based Clonal section algorithm and its variant (adaptive Clonal selection algorithm) for solving single objective optimal power flow (OPF) problems. This problem is formulated as optimization of cost, loss and L-index objectives individually by considering various security constraints. In order to study the effectiveness of the proposed methods, they are tested on standard IEEE 30-bus test system. Based on the comparative results, it is found adaptive Clonal selection algorithm (ACSA) performs better than the basic CSA.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

َA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times

This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...

متن کامل

New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)

Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...

متن کامل

Solving a Redundancy Allocation Problem by a Hybrid Multi-objective Imperialist Competitive Algorithm

A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective functi...

متن کامل

Solving Multi-objective Optimal Power Flow Using Modified GA and PSO Based on Hybrid Algorithm

The Optimal Power Flow (OPF) is one of the most important issues in the power systems. Due to the complexity and discontinuity of some parameters of power systems, the classic mathematical methods are not proper for this problem. In this paper, the objective function of OPF is formulated to minimize the power losses of transmission grid and the cost of energy generation and improve the voltage ...

متن کامل

Application of chaos-based chaotic invasive weed optimization techniques for environmental OPF problems in the power system

Article history: Received 9 April 2014 Accepted 8 October 2014 Available online 9 November 2014 This paper presents efficient chaotic invasive weed optimization (CIWO) techniques based on chaos for solving optimal power flow (OPF) problems with non-smooth generator fuel cost functions (non-smooth OPF) with the minimum pollution level (environmental OPF) in electric power systems. OPF problem is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013